Packing trees into complete bipartite graphs
نویسندگان
چکیده
منابع مشابه
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
For a set S of graphs, a perfect S-packing (S-factor) of a graph G is a set of mutually vertex-disjoint subgraphs of G that each are isomorphic to a member of S and that together contain all vertices of G. If G allows a covering (locally bijective homomorphism) to a graph H, i.e., a vertex mapping f : VG → VH satisfying the property that f(u)f(v) belongs to EH whenever the edge uv belongs to EG...
متن کاملA note on packing trees into complete bipartite graphs and on fishburn's conjecture
The sequence of graphs { G1, G2, . . . , G,} is said to be packed into a graph G if G has edge disjoint subgraphs HI, Hz, . . . , H, such that Hi G Gj, j = 1, . . . , t. We say that a graph G is m-panarboreal if each tree on m vertices, T,, can be packed into G. Gyarfas and Lehel [3] conjectured that if z is any tree of order i then the sequence of trees {T,, T3, . . . , T,} can be packed into ...
متن کاملPacking Trees into Planar Graphs
1 I n t r o d u c t i o n We say that the graphs H 1 , . . . , Hk can be packed into a graph G if G contains subgraphs isomorphic to H 1 , . . . , Hk and pairwise edge disjoint. The problem of packing graphs has been widely studied, especially when G is a complete graph. For instance, it is known that two trees with n vertices none of them equal to a star can be packed into K~ [2]. The packing ...
متن کاملEigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
متن کاملPacking trees into n-chromatic graphs
We show that if a sequence of trees T1, T2, ..., Tn−1 can be packed into Kn then they can be also packed into any n-chromatic graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.016